Formulations and branch-and-cut algorithms for production routing problems with time windows
نویسندگان
چکیده
منابع مشابه
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destinations. In addition to capacity and time window constraints, vehicle routes must also satisfy pairing and precedence constraints on pickups and deliveries. This paper introduces two new formulations for the PDPTW and the cl...
متن کاملRobust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
This article presents techniques for constructing robust Branch-Cutand-Price algorithms on a number of Vehicle Routing Problem variants. The word “robust” stress the effort of controlling the worst-case complexity of the pricing subproblem, keeping it pseudo-polynomial. Besides summarizing older research on the topic, some promising new lines of investigation are also presented, specially the d...
متن کاملFormulations and Solution Algorithms for Production and Inventory Routing Problems
An integrated supply chain operational planning system is a tool that is used to jointly optimize several planning decisions by capturing the additional bene ts of coordination between sequential activities in the chain. In recent years, many companies have set up an integrated planning system and achieved multi-million cost savings. The key to success is an application that is not only able to...
متن کاملLocation-Routing Problem with Fuzzy Time Windows and Traffic Time
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...
متن کاملA branch-price-and-cut for the vehicle routing problem with time windows and multiple deliverymen
We address a variant of the vehicle routing problem with time windows, which includes the decision of how many deliverymen should be assigned to each vehicle in addition to the usual routing and scheduling decisions. This variant is relevant in cases in which many requests should be delivered in busy urban areas on the same day, and the service times at customers are long in relation to vehicle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportmetrica A: Transport Science
سال: 2018
ISSN: 2324-9935,2324-9943
DOI: 10.1080/23249935.2018.1427157